Solving Impulsive Control Problems by Discrete-Time Dynamic Optimization Methods

نویسندگان

  • Rodrigo T. N. Cardoso
  • Ricardo H. C. Takahashi
چکیده

In many classes of continuous-time control problems coming from real world applications, control actions in the shape of jumps at certain instants can be useful to be considered. This technique is called impulsive control. The main idea is to split the continuous-time interval in some stages, performing control actions impulsively just in the instants among the stages, with the dynamic system keeping its autonomous dynamics within the stages. The concept and the principles of the impulsive control, and also some simple examples of applications in plants whose variables should be changed instantaneously have been presented by Yang [18,19]. In the present article, the solution of impulsive control problems is sought by a discrete-time point-of-view, by an open-loop continuous-variable dynamic optimization algorithm. Discrete-time dynamic programming is a well-known multi-stage optimization technique [2, 3], which has been used and showed to be a very powerful tool. The article [9] uses dynamic programming methods to resolve an impulsive control problem. in that work, solutions are synthesized via the Hamilton-Jacobi-Bellman (HJB) approach, like as in a continuous-time dynamic programming problem. The scheme proposed here is more flexible than the HJB approach, in terms of possibilities of the objective function and constraint definition, and is an alternative to using enumerative discrete-time dynamic programming algorithms, which have prohibitive computational complexity [3, 6]. Two relevant case studies are considered here: the biological control of plagues in a farm using a prey-predator model and the pulse vaccination strategy using a SIR epidemic model. Some recent applications of impulsive control in prey-predator models and in SIR epidemic models, for example, are presented in [10,15,20]. This article is structured as follows: Section 2 discusses the impulsive control. Section 3 discusses the discrete-time approach for impulsive control problems and presents an openloop dynamic optimization algorithm. Section 4 presents the application of the proposed methodology in two numerical case studies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A novel technique for a class of singular boundary value problems

In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...

متن کامل

A dynamic programming approach for solving nonlinear knapsack problems

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

متن کامل

Biorthogonal cubic Hermite spline multiwavelets on the interval for solving the fractional optimal control problems

In this paper, a new numerical method for solving fractional optimal control problems (FOCPs) is presented. The fractional derivative in the dynamic system is described in the Caputo sense. The method is based upon biorthogonal cubic Hermite spline multiwavelets approximations. The properties of biorthogonal multiwavelets are first given. The operational matrix of fractional Riemann-Lioville in...

متن کامل

DISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM

Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...

متن کامل

A Neural Network Method Based on Mittag-Leffler Function for Solving a Class of Fractional Optimal Control Problems

In this paper, a computational intelligence method is used for the solution of fractional optimal control problems (FOCP)'s with equality and inequality constraints. According to the Ponteryagin minimum principle (PMP) for FOCP with fractional derivative in the Riemann- Liouville sense and by constructing a suitable error function, we define an unconstrained minimization problem. In the optimiz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007